Stein’s method for the single server queue in heavy traffic
نویسندگان
چکیده
منابع مشابه
Heavy-traffic asymptotics for the single-server queue with random order of service
We consider the waiting time distribution of the Gl/Gl /1 queue where customers are served in random order; inter-arrival and service times may have finite or infinite variance. Our main result shows that the waiting time in heavy traffic can be written as a product of two random variables. Our proof is based on the intuitively appealing fact that in heavy traffic, the queue length stays consta...
متن کاملStationary Distribution Convergence for a Multiclass Single-server Queue in Heavy Traffic
In the author’s recent paper [11], it is established that in a multiclass single-server queue with regular service disciplines, the stationary distributions and their moments for workload as well as for queue length can be approximated by appropriate exponential distributions and their moments in the heavy-traffic regime. In this work, relaxing the assumption of moment generating function on th...
متن کاملHeavy-traffic limits for a single-server queue leading up to a critical point
We establish heavy-traffic limits for the arrival and workload processes in a single-server queue with a time-varying arrival-rate function. We establish limits at and before a critical point, the onset of critical loading, where the arrival-rate function approaches its critical value from below. We extend results by Newell (1968) and Mandelbaum and Massey (1995) and present alternative views o...
متن کاملHeavy-Traffic Limits for Loss Proportions in Single-Server Queues
We establish heavy-traffic stochastic-process limits for the queue-length and overflow stochastic processes in the standard single-server queue with finite waiting room (G/G/1/K). We show that, under regularity conditions, the content and overflow processes in related single-server models with finite waiting room, such as the finite dam, satisfy the same heavy-traffic stochastic-process limits....
متن کاملFINITE POPULATION SINGLE SERVER BATCH SERVICE QUEUE WITH COMPULSORY SERVER VACATION
A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics & Probability Letters
سال: 2020
ISSN: 0167-7152
DOI: 10.1016/j.spl.2019.108566